Cyclic Queueing Networks with Subexponential Service Times
نویسندگان
چکیده
For a K-stage cyclic queueing network with N customers and general service times we provide bounds on the n departure time from each stage. Furthermore, we analyze the asymptotic tail behavior of cycle times and waiting times given that at least one service time distribution is subexponential.
منابع مشابه
A General Class of Closed Fork and Join Queues with Subexponential Service Times
For a general class of closed feedforward fork and join queueing networks, we derive the tail asymptotics of transient cycle times and waiting times under the assumption that the service time distribution of at least one station is subexponential. We also argue that under certain conditions the asymptotic tail distributions remain the same for stationary cycle times and waiting times.
متن کاملAsymptotics of Closed Fork and Join Queues with Subexponential Service Times
We consider a closed fork and join queueing network where several lines feed a single assembly station. Under the assumption that at least one service time distribution is subexponential, we obtain the tail asymptotics of transient cycle times and waiting times. We also discuss under which conditions these results can be generalized to the tail asymptotics of stationary cycle times and waiting ...
متن کاملTail Asymptotics of Queueing Networks with Subexponential Service Times
To myself and my parents... iii ACKNOWLEDGEMENTS Throughout my graduate studies, I am indebted to many people for their help and encouragement. First of all, I would like to thank my advisor Prof. Hayriye Ayhan. It is impossible for me to express in words my full appreciation. However, I would like to thank all of her advice and support during my graduate studies. I would not have completed thi...
متن کاملAsymptotics of Stochastic Networks with Subexponential Service Times
We analyse the tail behaviour of stationary response times in the class of open stochastic networks with renewal input admitting a representation as (max; +){linear systems. For a K-station tandem network of single server queues with innnite buuer capacity, which is one of the simplest models in this class, we rst show that if the tail of the service time distribution of one server, say server ...
متن کاملTandem queues with subexponential service times and finite buffers
We focus on tandem queues with subexponential service time distributions. We assume that number of customers in front of the first station is infinite and there is infinite room for finished customers after the last station but the size of the buffer between two consecutive stations is finite. Using (max,+) linear recursions, we investigate the tail asymptotics of transient response times and w...
متن کامل